Associate languages and derivational complexity of formal grammars and languages
نویسندگان
چکیده
منابع مشابه
Harmonic Grammars for Formal Languages
Basic connectionist principles imply that grammars should take the form of systems of parallel soft constraints defining an optimization problem the solutions to which are the well-formed structures in the language. Such Harmonic Grammars have been successfully applied to a number of problems in the theory of natural languages. Here it is shown that formal languages too can be specified by Harm...
متن کاملExtension Complexity and Formal Languages
In this article we undertake a study of extension complexity from the perspective of formal languages. We define a natural way to associate a family of polytopes with binary languages. This allows us to define the notion of extension complexity of formal languages. We prove several closure properties of languages admitting compact extended formulations. Furthermore, we give a sufficient machine...
متن کاملDynamic Complexity of Formal Languages
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained using quantifier-free first-order updates, with and without auxiliary functions, respectively. It is shown that the languages maintainable in DynPROP exactly are the regular languages, even when allowing arbitrary preco...
متن کاملProbabilistic Grammars and Languages
A classic theorem of Ellis (1970) asserts that there are probabilistic languages (p-languages) that are not generated by any probabilistic finite state grammar (PFSG) even though their support (the set of strings with nonzero probability) is regular. Ellis’ proof is highly algebraic, and gives no indication why such p-languages exist. Suppes (1970) argued that Ellis’ construction is an artefact...
متن کاملFree Grammars and Languages
Floyd’s Operator Precedence languages (OPLs) were originally introduced to support deterministic parsing of programming languages [11]; then, interest in them decayed for several decades, probably due to the advent of more expressive grammars, such as LR ones which also allow for efficient deterministic parsing. Recently, however, we renewed our interest in this family of languages on the basis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1973
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(73)90237-4